cient Implementation of Schoof ' s Algorithm
نویسندگان
چکیده
Schoof's algorithm is used to nd a secure elliptic curve for cryptosystems, as it can compute the number of rational points on a randomly selected elliptic curve de ned over a nite eld. By realizing e cient combination of several improvements, such as Atkin-Elkies's method, the isogeny cycles method, and trial search by match-and-sort techniques, we can count the number of rational points on an elliptic curve over GF (p) in a reasonable time, where p is a prime whose size is around 240-bits.
منابع مشابه
The Sea Algorithm in Characteristic 2
The Schoof-Elkies-Atkin algorithm counts the number of rational points on elliptic curves over finite fields. This paper presents a number of optimizations specific for the characteristic two case. We give a detailed description of the computation of modular polynomials over F2n and the search for an eigenvalue in the Elkies algorithm. With our implementation, we were able to count the number o...
متن کاملCounting Points on Hyperelliptic Curves over Finite Fields
We describe some algorithms for computing the cardinality of hyperelliptic curves and their Jacobians over finite fields. They include several methods for obtaining the result modulo small primes and prime powers, in particular an algorithm à la Schoof for genus 2 using Cantor’s division polynomials. These are combined with a birthday paradox algorithm to calculate the cardinality. Our methods ...
متن کاملOn cyclotomic primality tests
In 1980, L. Adleman, C. Pomerance, and R. Rumely invented the first cyclotomic primality test, and shortly after, in 1981, a simplified and more efficient version was presented by H.W. Lenstra for the Bourbaki Seminar. Later, in 2008, Rene Schoof presented an updated version of Lenstra’s primality test. This thesis presents a detailed description of the cyclotomic primality test as described by...
متن کاملElliptic Gauss sums and applications to point counting
We shall first briefly review some general facts on elliptic curves over finite fields, and the algorithms of Schoof and Schoof Elkies Atkin (SEA) for counting points. We refer to text books as Cox, Silverman or Washington [Cox, Si, Wa] for the general topics and to the original papers of Schoof [Sch, Sch1] for a presentation of the algorithms. Let p be an odd prime. Consider the elliptic curve:
متن کامل18.783 Elliptic Curves Spring 2013 Lecture #9 03/07/2013 9.1 Schoof’s Algorithm
In the early 1980’s, René Schoof [3] introduced the first polynomial-time algorithm to compute #E(Fq). Extensions of Schoof’s algorithm remain the point-counting method of choice when the characteristic of Fq is large (e.g., when q is a cryptographic size prime).1 Schoof’s basic strategy is very simple: compute the the trace of Frobenius tmodulo many small primes ` and use the Chinese remainder...
متن کامل